Exact calculation of network robustness

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact calculation of robustness of entanglement via convex semi-definite programming

In general the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the the convex semidefinite programming method, the robustness of entanglement of some mixed entangled quantum states such as: 2⊗ 2 Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, 2⊗ 3 B...

متن کامل

Exact Calculation of Beta Inequalities

This paper addresses the problem of evaluating P (X > Y ) whereX and Y are independent beta random variables. We cast the problem in terms of a hypergeometric function and use hypergeometric identities to calculate the probability in closed form for certain values of the distribution parameters.

متن کامل

Efficient Calculation of Exact Group Delay Sensitivities

This paper presents, explicitly, an approach to the exact calculation of group delay and its sensitivities with respectto component parameters basedon the adjoint network conceptand applicable to linear time-invariant circnits. In general, no more than four analyses are reqnired and the computational effort is only moderately more than is necessary for a single analysis. The resnlts presented a...

متن کامل

Exact Gradient Calculation in Gamma Neural Networks

In this paper we introduce a novel algorithm for computation of the exact error gradient for a gamma network with an arbitrary feedforward topology. An approximate algorithm with reduced computational complexity referred to as Truncated Temporal Backpropagation is also developed. Time series prediction experiments using Mackey-Glass chaotic time series show improved training convergence for our...

متن کامل

Robustness analysis of network controllability

Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Reliability Engineering & System Safety

سال: 2019

ISSN: 0951-8320

DOI: 10.1016/j.ress.2018.11.020